Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract)
نویسندگان
چکیده
We apply van Emde Boas-type stratified trees to point location problems in rectangular subdivisions in 2 and 3 dimensions. In a subdivision with n rectangles having integer coordinates from [1, U], we locate an integer query point in O«loglog U)d) query time using O(n) space when d ~ 2 or O(nloglogU) space when d = 3. Applications and extensions of this ''fixed universe" approach include point location using logarithmic time an~ linear space in rectilinear subdivisions having arbitrary coordinates, point location in c-oriented polygons or fat triangles in the plane, point location in subdivisions of space into "fat prisms," and vertical ray shooting among horizontal "fat objects." Like other results on stratified trees, our algorithms run on a RAM model and make use of perfect hashing.
منابع مشابه
Two-and Three-dimensional Point Location in Rectangular Subdivisions
We apply van Emde Boas-type stratiied trees to point location problems in rectangular subdivisions in 2 and 3 dimensions. In a subdivision with n rectangles having integer coordinates from 0; U ? 1], we locate an integer query point in O((log logU) d) query time using O(n) space when d 2 or O(n loglog U) space when d = 3. Applications and extensions of this \\xed universe" approach include spat...
متن کاملEfficient Point Location in a Convex Spatial Cell-Complex
In this paper a new approach is proposed to point-location in a three-dimensional cell-complex 7 , which may be viewed as a nontrivial generalization of a corresponding two-dimensional technique due to Sarnak and Tarjan. Specifically, in a space-sweep of 7), the intersections of the sweep-plane with P occurring in a given slab, i.e., between two consecutive vertices, are topologically conformal...
متن کاملComputational Geometric Learning Improved Implementation of Point Location in General Two-Dimensional Subdivisions
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point ...
متن کاملImproved Implementation of Point Location in General Two-Dimensional Subdivisions
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point ...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کامل